Bottleneck Capacity Expansion Problems with General Budget Constraints
نویسندگان
چکیده
منابع مشابه
The budget constrained r-interdiction median problem with capacity expansion
In this article, we elaborate on a budget constrained extension of the r -interdiction median problem with fortification (RIMF). The objective in the RIMF is to find the optimal allocation of protection resources to a given service system consisting of p facilities so that the disruptive effects of r possible attacks to the system are minimized. The defender of the system needs to fortify q fac...
متن کاملOn The Bottleneck and Capacity Assignment Problems
The bottleneck (capacity) assignment problem seeks for a set of entries in a matrix A, one for each column and row, that minimizes (maximizes) the largest (smallest) element over all such sets. Our interest lies in finding the asymptotically exact solution to these problems in a probabilistic framework, that is, under the asswnption that elements in the matrix are independent random variables w...
متن کاملCompact Location Problems with Budget and Communication Constraints
We consider the problem of placing a speciied number p of facilities on the nodes of a given network with two nonnegative edge{ weight functions so as to minimize the diameter of the placement with respect to the rst weight function subject to a diameter{ or sum{ constraint with respect to the second weight function. Deene an (;){approximation algorithm as a polynomial{time algorithm that produ...
متن کاملOligopoly with Capacity Constraints and Thresholds
Abstract Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...
متن کاملAuctions with Budget Constraints
In a combinatorial auction k different items are sold to n bidders, where the objective of the seller is to maximize the revenue. The main difficulty to find an optimal allocation is due to the fact that the valuation function of each bidder for bundles of items is not necessarily an additive function over the items. An auction with budget constraints is a common special case where bidders gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 2001
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro:2001100